Secure Reputation Mechanism For Unstructured Peer To Peer System
نویسنده
چکیده
Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We address both of these problems through replica placement. In its simplest form, a peer-topeer network is created when two or more PCs are connected and share resources without going through a separate server computer. In effect, every connected PC is at once a server and a client. Peer to peer networks can be categorized into structured and unstructured peer to peer networks. The proposed system can be used on top of both structured and unstructured peer to peer networks. In structured networks, the peer or system which start to search a file into other peers by establishing paths (i.e. the source system knows where the searching happen are). The unstructured peer to peer networks do not have a well-known architecture. In unstructured networks, there is no relationship between the source with other peers except neighbor peer and its location. Our proposed work is to search a file in a structured and unstructured peer to peer network. The absence of a central authority in a peer to peer network poses unique challenges for reputation management in the network. These challenges include identity management of the peers, secure reputation data management, Sybil attacks, and above all, availability of reputation data. Reputation management is each and every peer must store the searching and file identified information or details which help to reduce the searching time in both type of peer to peer network. Need security for unstructured network search because the searching peer doesn’t know where the file is searched and download. In this project, we added a cryptographic protocol for ensuring secure and timely availability of the reputation data of a peer to other peers at extremely low costs. Content auditing is done on receiver side even signature fails and mentions the ratio or impact of fake content. As result, a peer’s reputation motivates it to cooperate and desist from malicious activities. The cryptographic protocol is coupled with self-certification and cryptographic mechanisms for identity management and countering Sybil attack.
منابع مشابه
Gossip-Based Reputation Management for Unstructured Peer-to-Peer Networks*
To build an efficient reputation system for peer-to-peer (P2P) networks, we need fast mechanisms to aggregate peer evaluations and to disseminate updated scores to a large number of peer nodes. Unfortunately, unstructured P2P networks are short of secure hashing and fast lookup mechanisms as in structured P2P systems like the DHT-based Chord. In light of this shortcoming, we propose a gossiping...
متن کاملDiscrete Markov Chain Model for Reputation Estimation of Unstructure P2p Network
Building trust relationships between peers is an important and difficult part in the security needs of P2P network without a central server. P2P reputation system has been introduced which collects locally generated peer feedbacks and aggregates them to yield global reputation scores. Most P2P applications on the Internet are unstructured, without fast hashing and searching mechanisms, how to p...
متن کاملA Sybilproof Indirect Reciprocity Mechanism for Peer-to-Peer Networks
Although direct reciprocity (Tit-for-Tat) contribution systems have been successful in reducing freeloading in peerto-peer overlays, it has been shown that, unless the contribution network is dense, they tend to be slow (or may even fail) to converge [1]. On the other hand, current indirect reciprocity mechanisms based on reputation systems tend to be susceptible to Sybil attacks, peer slander ...
متن کاملSecure and Distributed P2P Reputation Management
The open, sharing and anonymous nature of peer-to-peer (P2P) network has offered opportunities and threats for the development of distributed computing technology. One feasible way to minimize threats is to establish the reputation-based global trust model. Most of current trust mechanisms are not only unable to restrain effectively such malicious behavior as collusive attacks, but also take no...
متن کاملBarterCast: Fully Distributed Sharing-Ratio Enforcement in BitTorrent
Peer-to-peer (p2p ) file sharing systems rely on the sharing of resources by large fractions of participants. Sharing-ratio enforcement provides a very strong incentive for peers to contribute, leading to a higher performance for all peers in the system. One way of implementing this is by banning peers that do not share enough, determined by their past behavior (i.e., reputation). Various reput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014